First-Order Semantics for Higher-Order Languages
نویسندگان
چکیده
منابع مشابه
First-Order Proofs for Higher-Order Languages
We study the use of the-calculus for semantical descriptions of higher-order concurrent languages with state. As an example, we choose Concurrent Idealized ALGOL (CIA). CIA is particularly interesting as, yet being a core language, it combines imperative and parallel features with a procedural mechanism of full higher order. It can thus be used as a formal model for concurrent programs as, e.g....
متن کاملFirst Order vs. Higher Order Modification in Distributional Semantics
Adjectival modification, particularly by expressions that have been treated as higherorder modifiers in the formal semantics tradition, raises interesting challenges for semantic composition in distributional semantic models. We contrast three types of adjectival modifiers – intersectively used color terms (as in white towel, clearly first-order), subsectively used color terms (white wine, whic...
متن کاملA Semantics for Pointcuts and Advice in Higher-Order Languages
Aspect-oriented programming has proven to be a useful model for developing software that encapsulates features in separate modules. AspectJ [3], one popular aspect-oriented language, extends Java with pointcuts and advice, which allow the programmer to modify the execution of existing code. However, formal semantics for pointcuts and advice only cover first-order procedural languages. We wish t...
متن کاملHigher-order semantics for quantum programming languages with classical control
This thesis studies the categorical formalisation of quantum computing, through the prism of type theory, in a three-tier process. The first stage of our investigation involves the creation of the dagger lambda calculus; a lambda calculus for dagger compact categories [AC04]. Our second contribution lifts the expressive power of the dagger lambda calculus to that of a quantum programming langua...
متن کاملHigher-Order Logic Programming Languages with Constraints: A Semantics
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic formal system, hoHH(C) (higher-order hereditary Harrop formulas with constraints), which extends λProlog’s logic, is shown sound and complete. A Kripke semantics for equational reasoning in the simply typed lambda-calcu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Crítica (México D. F. En línea)
سال: 1977
ISSN: 1870-4905,0011-1503
DOI: 10.22201/iifs.18704905e.1977.221